Incremental SAT Library Integration Using Abstract Stobjs
نویسندگان
چکیده
منابع مشابه
Incremental SAT Solving for SAT Based Planning
One of the most successful approaches to automated planning is the translation to propositional satis ability (SAT). This thesis evaluates incremental SAT solving for several modern encodings for SAT based planning. Experiments based on benchmarks from the 2014 International Planning Competition show that an incremental approach signi cantly outperforms non-incremental solving. Although, planni...
متن کاملPreprocessing in Incremental SAT
Preprocessing of CNF formulas is an invaluable technique when attempting to solve large formulas, such as those that model industrial verification problems. Unfortunately, the best combination of preprocessing techniques, which involve variable elimination combined with subsumption, is incompatible with incremental satisfiability. The reason is that soundness is lost if a variable is eliminated...
متن کاملUltimately Incremental SAT
Incremental SAT solving under assumptions, introduced in Minisat, is in wide use. However, Minisat’s algorithm for incremental SAT solving under assumptions has two main drawbacks which hinder performance considerably. First, it is not compliant with the highly effective and commonly used preprocessor SatELite. Second, all the assumptions are left in the formula, rather than being represented a...
متن کاملAbstract Stobjs and Their Application to ISA Modeling
In support of our modeling and verification efforts for microprocessors, we have introduced a new ACL2 event to support the definition of abstract stobjs. The traditional single-threaded objects supported by ACL2, “concrete” stobjs [10], are well known to support efficient execution. While they allow a user to specify datatype restrictions for each defined field, they do not permit restrictions...
متن کاملIncremental Compilation-to-SAT Procedures
We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework that encompasses all the aspects of an incremental decision procedure, from the encoding to the incremental solver. We apply our guidelines to a real-world CTS approach (Bounded Model Checking) and show how to modify ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2018
ISSN: 2075-2180
DOI: 10.4204/eptcs.280.4